A Metaheuristic Algorithm for Job Scheduling in Grid Computing
نویسندگان
چکیده
منابع مشابه
GLOA: A New Job Scheduling Algorithm for Grid Computing
— The purpose of grid computing is to produce a virtual supercomputer by using free resources available through widespread networks such as the Internet. This resource distribution, changes in resource availability, and an unreliable communication infrastructure pose a major challenge for efficient resource allocation. Because of the geographical spread of resources and their distributed manage...
متن کاملA Cluster Based Job Scheduling Algorithm for Grid Computing
Grid computing enables sharing, selection and aggregation of computing resources for solving complex and large-scale scientific problems. The resources making up a grid need to be managed to provide a good quality of service. Grid scheduling is a vital component of a Computational Grid infrastructure. This paper presents a dynamic cluster based job scheduling algorithm for efficient execution o...
متن کاملAn Adaptive Scoring Job Scheduling algorithm for grid computing
When human culture advances, current problems in science and engineering become more complicated and need more computing power to tackle and analyze. A supercomputer is not the only choice for solving complex problems any more as a result of the speed-up of personal computers and networks. Grid technology, which connects a number of personal computer clusters with high speed networks, can achie...
متن کاملJob Scheduling in Grid Computing with Cuckoo Optimization Algorithm
Computational grid is a hardware and software infrastructure that provides dependable, inclusive and credible to other computing capabilities. Grid computing intercommunicated with a set of computational resources on a large scale. Scheduling independent jobs is an important issues in such areas as computational grid. Scheduling is the process of assigning jobs to resources in order to achieve ...
متن کاملA Multiobjective Metaheuristic for Job-shop Scheduling
In this paper, we introduce a nature inspired meta-heuristic for scheduling jobs on computational grids. Our approach is to dynamically generate an optimal schedule so as to complete the tasks in a minimum period of time as well as utilizing the resources in an efficient way. The approach proposed is a variant of particle swarm optimization which uses mutation operator. The mutation operator ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Education and Computer Science
سال: 2014
ISSN: 2075-0161,2075-017X
DOI: 10.5815/ijmecs.2014.05.07